Computing Convex Hulls Using Smart Pixels
نویسندگان
چکیده
We consider a problem domain consisting of a quadratic grid of n “smart pixels” which observe a black-andwhite image. Each of these smart pixels can communicate with its direct neighbors and perform simple computations. Contiguous groups of black pixels form objects on the grid. We present a deterministic algorithm to compute the convex hulls of all objects on the pixel grid simultaneously in time O( √ n).
منابع مشابه
Space Subdivision to Speed-up Convex Hull Construction in E3
Convex hulls are fundamental geometric tools used in a number of algorithms. This paper presents a fast, simple to implement and robust Smart Convex Hull (S-CH) algorithm for computing the convex hull of a set of points in . This algorithm is based on “spherical” space subdivision. The main idea of the S-CH algorithm is to eliminate as many input points as possible before the convex hull constr...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملShortest Paths and Convex Hulls in 2D Complexes with Non-Positive Curvature
Globally non-positively curved, or CAT(0), polyhedral complexes arise in a number of applications, including evolutionary biology and robotics. These spaces have unique shortest paths and are composed of Euclidean polyhedra, yet many properties of convex hulls in Euclidean space fail to transfer over. We give examples of some such properties. For 2-dimensional CAT(0) polyhedral complexes, we gi...
متن کاملDivide-and-Conquer 3D Convex Hulls on the GPU
We describe a pure divide-and-conquer parallel algorithm for computing 3D convex hulls. We implement that algorithm on GPU hardware, and find a significant speedup over comparable CPU implementations.
متن کاملFormal Proof in Coq and Derivation of an Imperative Program to Compute Convex Hulls
This article deals with a method to build programs in computational geometry from their specifications. It focuses on a case study namely computing incrementally the convex hull of a set of points in the plane using hypermaps. Our program to compute convex hulls is specified and proved correct using the Coq proof assistant. A concrete implementation in Ocaml is then automatically extracted and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010